Eigenvalues and Diameter
نویسندگان
چکیده
Let G be a connected graph of order n. The diameter of a graph is the maximum distance between any two vertices of G. In this paper, we will give some bounds on the diameter of G in terms of eigenvalues of adjacency matrix and Laplacian matrix, respectively.
منابع مشابه
The minimum number of distinct eigenvalues among the symmetric matrices with a given graph
A classic result is that the number of distinct eigenvalues of a graph of diameter d is at least d+1. More generally, let G be a graph with n vertices, and let S(G) denote the set of all symmetric n by n matrices, A = [aij ], with the property that for off-diagonal entries, aij is nonzero if and only if G has an edge from i to j. The traditional proof of the classic result extends to A ∈ S(G). ...
متن کاملOn Distance Energy of Graphs
The D-eigenvalues of a graph G are the eigenvalues of its distance matrix D , and the D-energy ED(G) is the sum of the absolute values of its D-eigenvalues. Two graphs are said to be D-equienergetic if they have the same D-energy. In this note we obtain bounds for the distance spectral radius and D-energy of graphs of diameter 2. Pairs of equiregular D-equienergetic graphs of diameter 2, on p =...
متن کاملLower Bounds of the First Closed and Neumann Eigenvalues of Compact Manifolds with Positive Ricci Curvature
We give new estimates on the lower bounds for the first closed and Neumann eigenvalues for the compact manifolds with positive Ricci curvature in terms of the diameter and the lower bound of Ricci curvature.
متن کاملThe diameter and Laplacian eigenvalues of directed graphs
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly connected directed graphs G, namely D(G) ≤ ⌊ 2maxx log(1/φ(x)) log 2 2−λ ⌋ + 1 where λ is the first non-trivial eigenvalue of the Laplacian and φ is the Perron vector of the transition probability matrix of a random walk ...
متن کاملD-Spectrum and D-Energy of Complements of Iterated Line Graphs of Regular Graphs
The D-eigenvalues {µ1,…,µp} of a graph G are the eigenvalues of its distance matrix D and form its D-spectrum. The D-energy, ED(G) of G is given by ED (G) =∑i=1p |µi|. Two non cospectral graphs with respect to D are said to be D-equi energetic if they have the same D-energy. In this paper we show that if G is an r-regular graph on p vertices with 2r ≤ p - 1, then the complements of iterated lin...
متن کامل